Enclosing Solutions of Linear Equations

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Enclosing Solutions of Linear Equations

It is shown that Rump’s method for enclosing solutions of linear equations can be reformulated in an interval–free form and that the underlying inclusion result can be proved by elementary means without using Brouwer’s fixed–point theorem. A sufficient condition on Rump’s “inflation parameter” ε is given under which finite termination occurs. Also, a more general modified algorithm is studied f...

متن کامل

Enclosing solutions of overdetermined systems of linear interval equations

A method for enclosing solutions of overdetermined systems of linear interval equations is described. Several aspects of the problem (algorithm, enclosure improvement, optimal enclosure) are studied.

متن کامل

A general method for enclosing solutions of interval linear equations

We describe a general method for enclosing the solution set of a system of interval linear equations. We present a general theorem and an algorithm in a MATLAB-style code. The result is called a “method”, not an “algorithm”, because it involves solving absolute value matrix inequalities; the way how to solve these inequalities will be explained elsewhere.

متن کامل

Enclosing Solutions of Linear Complementarity Problems for H-Matrices

The paper establishes a computational encIosure of the solution of the linear complementarity problem (q, M), where M is assumed to be an H-matrix with a positive main diagonal. A dass of problems with interval data, which can arise in approximating the solutions of free boundary problems, is also treated successfully.

متن کامل

Solutions of Linear Equations

For simplicity, we follow the rules: x denotes a set, i, j, k, l, m, n denote natural numbers, K denotes a field, N denotes a without zero finite subset of N, a, b denote elements of K, A, B, B1, B2, X, X1, X2 denote matrices over K, A′ denotes a matrix over K of dimension m × n, B′ denotes a matrix over K of dimension m × k, and M denotes a square matrix over K of dimension n. We now state a n...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SIAM Journal on Numerical Analysis

سال: 1998

ISSN: 0036-1429,1095-7170

DOI: 10.1137/s0036142996299423